Arbitrarily accurate composite pulse sequences

ABSTRACT

The present invention is a method for constructing fully-compensating composite pulses of arbitrary accuracy that can correct pulse power errors to any desired order. The invention has two preferred embodiments, the Trotter-Suzuki (TS) embodiment and the Solovay-Kitaev (SK) embodiment. Each preferred embodiment can be represented by a mathematical algorithm, which can be easily implemented on a computer, for constructing a list of phases {φ 1 , . . . , φ l } and rotation angles {θ 1 , . . . , θ l } that amounts to a composite pulse. The pulses can then be used for nuclear magnetic resonance, quantum computing, or any other application based on pulsed excitations. The present invention, as embodied in the pulse sequences SK n and TS n, allows the user to transform a pulse sequence of error ε to a robust pulse sequence with error O(ε n ) for arbitrary n. The sequences can be implemented using any existing quantum computer or NMR hardware.

RELATED APPLICATIONS

This application claims priority to U.S. Provisional Application Ser. No. 60/571,192, filed May 14, 2004.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH

This invention was made with U.S. government support under Grant Numbers DAAD19-01-1-06 and DAAD 19-03-1-0075. awarded by the Army. The government has certain rights in this invention.

FIELD OF THE INVENTION

This invention relates to the control of quantum systems and, in particular, to fully compensating composite pulses that can be used to correct systematic control errors.

BACKGROUND

Precise and complete control over closed quantum systems is a long-sought goal in atomic physics, molecular chemistry, condensed matter research, with fundamental implications for metrology [J. J. Bollinger, W. M. Itano, D. J. Wineland, and D. J. Heinzen, Phys. Rev. A 54, R4649, (1996); C. H. Bennett and P. W. Shor, IEEE Transactions on Information Theory, 44, 2724 (1998)] and computation [M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, UK, 2000); A. Steane, Rep. Prog. Phys. 61, 117 (1998)]. Achieving this goal will require careful compensation for errors of both random and systematic nature. While recent advances in quantum error correction [D. Gottesman, Phys. Rev. A 57, 127 (1998); A. M. Steane, Phys. Rev. Lett. 77, 793 (1996); E. Knill and R. Laflamme, Phys. Rev. A 55, 900 (1997), quant-ph/9604034] allows all such errors to be removed in principle, active error correction requires expanding the size of the quantum system, as well as feedback measurements that may be unavailable. Furthermore, in many systems, errors may be dominated by those of systematic nature, rather than by random errors, such as when the classical control apparatus is miscalibrated or suffers from inhomogeneities over the spatial extent of the target quantum system.

Such systematic errors are common in the art of nuclear magnetic resonance (NMR), where radio frequency fields (RF) applied to control nuclear spins in molecules often have pulse amplitude errors or are inhomogeneous across the sample. Of course, systematic errors can be reduced simply by calibration, but that is often impractical, especially when controlling large systems or when the required control error magnitude is smaller than what is easily measurable. Interestingly, however, systematic errors in controlling quantum systems can be compensated without specific knowledge of the magnitude of the error. This fact is lore [R. Freeman, Spin Choreography (Spektrum, Oxford, 1997)] in the art of NMR, and is achieved by using the method of composite pulses, in which a single imperfect pulse with fractional error E is replaced with a sequence of pulses, which reduces the error to O(ε^(n)).

Composite pulse sequences have been constructed to correct for a wide variety of systematic errors in NMR [R. Freeman, Spin Choreography (Spektrum, Oxford, 1997); M. Levitt and R. Freeman, J. Magn. Reson. 33, 473 (1979); R. Tycko, Phys. Rev. Lett. 51, 775 (1983)], including pulse amplitude, phase, and frequency errors. For example, in magnetic resonance imaging, composite pulse sequences can enhance frequency selectivity, and thereby increase the resolution with which spatial details can be distinguished. Generally, however, in NMR the goal is to maximize the measurable signal from a spin system that starts in a specific state. Thus, while composite sequences have been developed [M. Levitt and R. R. Ernst, J. Magn. Reson. 55, 247 (1983)] which can reduce errors to O(ε^(n)) for arbitrary n, these sequences are not general and do not apply, for example, to quantum computation, where the initial state is arbitrary and multiple operations must be cascaded in order to obtain desired multi-qubit transformations. Pulse sequences of this type have been previously patented, e.g. U.S. Pat. No. 5,153,515 (“Methods of generating pulses for selectively exciting frequencies”; Leigh et al) and U.S. Pat. No. 5,572,126 (“Reduced power selective excitation RF pulses”; Shinnar) [see also LeRoux “Method of radio-frequency excitation in an NMR experiment,” U.S. Pat. No. 4,940,940, 1990].

Only a few composite pulse sequences are known which are fully compensating [M. Levitt, Prog. in NMR Spectr. 18, 61 (1986)], meaning that they work on any initial state and can replace a single pulse without further modification of other pulses. As has been theoretically discussed [H. Cummins and J. Jones, New J. Phys. 2.6, 1 (2000); J. Jones, Phys. Rev. A 67, 012317 (2002); D. McHugh and J. Tawnley, quant-ph/0404127 (2004)] and experimentally demonstrated [S. Gulde, M. Riebe, G. P. T. Lancaster, C. Becher, J. Eschner, H. Hffner, F. Schmidt-Kaler, I. L. Chuang, and R. Blatt, Nature 421, 48 (2003)], these sequences can be valuable for quantum computation and quantum information tasks, such as precise single and multiple-qubit control using gate voltages or laser excitation. However, these pulse sequences cannot currently be effectively used to compensate for errors of both random and systematic nature. What has been needed, therefore, are composite pulses that are both fully compensating and able to correct errors arbitrarily well.

SUMMARY

These and other objectives are met by the present invention, which is a system for producing composite pulses that are fully compensating, i.e. can replace a single pulse without further modification of the pulse sequence, and that can also correct pulse power errors to any desired order. Each method can be represented by a mathematical algorithm, which can be easily implemented on a computer, for constructing a list of phases {φ₁, . . . , φ_(l)} and rotation angles {θ₁, . . . , θ_(l)} that amounts to a composite pulse. The pulses can then be used for nuclear magnetic resonance, quantum computing, or any other application based on pulsed excitations. The composite pulses of the present invention can be implemented using the existing quantum computer or NMR hardware.

A composite pulse sequence R_(φ) ^([n])(θ) is a sequence of operations {M_(φ) ₁ (θ₁), . . . , M_(φ) _(l) (θ_(l))} such that R_(φ) ^([n])(θ)=M_(φ) ₁ (θ₁)M_(φ) ₂ (θ₂) . . . M_(φ) _(l) (θ_(l))=R_(φ)(θ)+O(ε^(n+1)), for unknown error ε. To construct R_(φ) ^([n])(θ), note that R_(φ)(−θε)M_(φ)(θ)=R_(φ)(θ) and M_(φ)(2kπ)=±R_(φ)(2kπε) when k is an integer. A composite pulse sequence can thus be obtained by finding ways to approximate R_(φ)(−θε) by a product of operators R_(φ) _(l) (2k_(l) 90 ε). The first preferred embodiment of the present invention is the Trotter-Suzuki (TS) method. Suzuki has developed a set of Trotter formulas whereby, when given a Hermitian matrix B (B_(ij)*=B_(ji)) and a series of Hermitian matrices {A_(l)}, such that B=ΣA_(l), there exists a set of real numbers {p_(jn)} such that

${{\exp\left( {- {iBt}} \right)} = {{\prod\limits_{j,l}{\exp\left( {{- {ip}_{jn}}A_{l}t} \right)}} + {O\left( t^{n + 1} \right)}}},$

-   -   and Σ_(j)p_(jn)=1. Without loss of generality, this may be         limited to expansions where the p_(jn) are rational numbers and         the assumption may be made that the goal is to approximate         R₀(−θε). Using Equation 2, set t=ε and B=−(θ/2)X. Then choose         A₁=A₃=mπ(X cos φ+Y sin φ) and A₂=2mπ(X cos φ−Y sin φ), where φ         and m fulfill the conditions that 4mπ cos φ=θ/2 (i.e.,         A₁+A₂+A₃=B) and q_(jn)=p_(jn)m is an integer. This yields an n         th order correction sequence

$\begin{matrix} {F_{n} = {\prod\limits_{j}{{M_{\phi}\left( {2\pi\; q_{jn}} \right)}{M_{- \phi}\left( {4\pi\; q_{jn}} \right)}{M_{\phi}\left( {2\pi\; q_{jn}} \right)}}}} \\ {= {{R_{0}\left( {- {\theta ɛ}} \right)} + {O\left( ɛ^{n + 1} \right)}}} \\ {= {R_{0}^{\lbrack n\rbrack}\left( {- {\theta ɛ}} \right)}} \end{matrix}$

-   -   and the associated n th order composite pulse sequence         F_(n)M₀(θ)=R₀ ^([n])(−θε)R₀(θε)R₀(θ)=R₀ ^([n])(θ) thus giving a         composite pulse sequence of arbitrary accuracy.

The second preferred embodiment of the present invention is the Solovay-Kitaev (SK) method. First, note that rotations U_(k)(A)=I+Aε^(k)+O(ε^(k+1)) can be constructed for arbitrary 2×2 Hermitian matrices A, and k≧1, recursively. This is done using an observation relating the commutator [A,B]=AB−BA to a sequence of operations, exp(−iAε^(l))exp(−iBε^(m))exp(iAε^(l))exp(iBε^(m))=exp([A,B]ε^(l+m))+O(ε^(l+m+1)). Thus to generate U_(k)(A), it suffices to generate U_(┌k/2┐)(B) and U_(└k/2┘)(C), such that [B,C]=A. Choices of integers other than ┌k/2┐ and └k/2┘ which sum to k are also fine, but less optimal. Next, a composite pulse sequence F_(n) for R₀(θ) is inductively constructed. Note that the first order correction sequence can be written as F₁=M_(φ)(2π)M_(−φ)(2π)=R₀(−θε)+O(ε²) by selecting 4π cos(φ)=θ. Assuming F_(n)=R₀(−θε)−iA_(n+1)ε^(n+1)+O(e^(n+2)), a sequence may be constructed to correct for the next order, using F_(n+1)=U_(n+1)(A_(n+1))F_(n), where U_(n+1)(A_(n+1)) is constructed as above. Iteratively applying this method for k=1, . . . , n yields an n th order composite pulse sequence, F_(n)M₀(θ)=R₀ ^([n])(θ), for any n.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 a illustrates the method of the present invention, in context;

FIG. 1 b illustrates an embodiment of an apparatus for implementing the present invention, in context;

FIG. 2 is a schematic representation of the Trotter-Suzuki embodiment of the present invention;

FIG. 3 is a schematic representation of the Solovay-Kitaev embodiment of the present invention;

FIG. 4 is a graph depicting a comparison of the narrowband and broadband composite pulse sequences generated by the Trotter-Suzuki method according to one embodiment of the present invention; and

FIG. 5 is a graph depicting composite pulse error, E, as a function of base error, ε for a variety of composite pulse sequences, including composite pulse sequences generated by the Solovay-Kitaev method according to one embodiment of the present invention.

DETAILED DESCRIPTION

The present invention is a method for constructing fully-compensating composite pulses that correct pulse power errors to any desired order. Previously these features have appeared only separately. Each method can be represented by a mathematical algorithm, which can be easily implemented on a computer, for constructing a list of phases {φ₁, . . . , φ_(l)} and rotation angles {θ₁, . . . , θ_(l)} that amounts to a composite pulse. The pulses can then be used for nuclear magnetic resonance, quantum computing, or any other application based on pulsed excitations. The present invention, as embodied in the pulse sequences SK n and TS n, allows the user to transform a pulse sequence of error ε to a robust pulse sequence with error O(ε^(n)) for arbitrary n. The sequences can be implemented using existing quantum computer or NMR hardware.

The present invention provides a method for effecting arbitrarily precise control over spin systems, using only an imperfect control apparatus. This is done without regard to the specific level of imperfection; aside from knowledge that the error is along a certain degree of freedom, such as amplitude or phase, no feedback or prior characterization of the systematic control imperfection is required. Instead, the method prescribes a sequence of control actions to be performed, such that the unknown imperfection cancels out, due to the inherent nature of quantum spin system dynamics. The length of the sequence determines the level of reduction of imperfection; the method provides a quantitative formula such that a sequence can be found to reduce the imperfection to any desired level.

Previously, the best fully compensating composite pulse sequence known [S. Wimperis, J. Magn. Reson. B 109, 221 (1994)] could only correct errors to O(ε³). In H. Cummins and J. Jones, New J. Phys. 2.6, 1 (2000); J. Jones, Phys. Rev. A 67, 012317 (2002); and D. McHugh and J. Tawnley, quant-ph/0404127 (2004), the distance measure used is one minus the fidelity, 1−∥V^(†)U∥ (“the infidelity”) where ∥A∥ is the norm of A. The present invention instead uses the trace distance, ∥V−U∥, following the NMR community. Thus, the composite pulses of the present invention which are n th order in trace distance are 2n th order in infidelity. The present invention is a new, systematic technique for creating composite pulse sequences to correct errors to O(ε^(n)), for arbitrary n. The present invention has been implemented for the specific case of systematic amplitude errors, using two approaches. Also discussed is the number of pulses required as a function of n.

These pulses perform the crucial function of transforming classical control with systematic error into arbitrarily accurate quantum control. Due to their fully compensating nature, any complex NMR sequence or quantum computing algorithm can substitute bare pulses with composite pulses without sequence modification. The role of composite pulses in these technologies is shown schematically in FIGS. 1 a and 1 b. As shown in FIG. 1 a, pulse sequence 110 having uncontrolled error, ε, is acted on by composite pulse algorithm 120 to achieve desired error reduction 130, n, producing robust pulse sequence 140 having reduced error, ε^(n). As seen in FIG. 1 b, computer 150 produces a composite pulse sequence, TS n or SK n that controls pulse generator 160, correcting the generated pulses for systematic errors. The corrected pulses are then used to control quantum computer or NMR device 170.

The major application of the present invention is the reduction of control errors. As explained below, it is also possible to use this invention to enhance errors due to inhomogeneity. These narrowband composite pulses yield a new way to increase spatial resolution in magnetic resonance imaging. The problem of systematic amplitude errors is modeled by representing single qubit rotations as

$\begin{matrix} {{{R_{\phi}(\theta)} = {\exp\left\lbrack {{- i}\;\frac{\theta}{2}\sigma_{\phi}} \right\rbrack}},} & (1) \end{matrix}$

-   -   where θ is the desired rotation angle about the axis that makes         the angle φ with the {circumflex over (x)}-axis and lies in the         {circumflex over (x)}-ŷ plane, σ_(φ)=cos(φ)X+sin(φ)Y, and X and         Y are two of the Pauli operators:

${X = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}},{Y = \begin{pmatrix} 0 & {- i} \\ i & 0 \end{pmatrix}},{Z = \begin{pmatrix} 1 & 0 \\ 0 & {- 1} \end{pmatrix}}$

R_(φ)(θis the ideal operation and, due to errors, the actual operation is, instead, M_(φ)(θ)=R_(φ)(θ(1+ε)), where the angle of rotation differs from the desired θ by the factor 1+ε. Note that φ and θ may be specified arbitrarily, but the error ε is fixed for all operations, and unknown. An example of this sort of error is RF inhomogeneity in NMR; there it is still possible to precisely control the phase of the pulses, but their magnitude has spatial variations that cannot be corrected by calibration.

A composite pulse sequence R₀ ^([n])(θ) is a sequence of operations {M_(φ) ₁ (θ₁), . . . , M_(φ) _(l) (θ_(l))} such that R_(φ) ^([n])(θ)=M_(φ) ₁ (θ₁)M_(φ) ₂ (θ₂) . . . M_(φ) ₁ (θ_(l))=R_(φ)(θ)+O(ε^(n+1)), for unknown error ε. Note that AB to denotes three interchangeable operations depending on the interpretation: a) if A and B are 2×2 matrices, then AB denotes matrix multiplication; b) if A and B are power series of 2×2 matrices, A=Σ_(n≧0)A_(n)ε^(n), B=Σ_(n≧0)B_(n)ε^(n), then AB is the product of power series, AB=Σ_(n≧0)(Σ_(k=0) ^(n)A_(k)B_(n−k))ε^(n); c) if A and B are sequences of pulses, then AB represents their concatenation.

The present invention has two currently preferred embodiments, the Trotter-Suzuki embodiment and the Solovay-Kitaev embodiment. To construct R_(φ) ^([n])(θ), begin with two simple observations: first, R_(φ)(−θε)M_(φ)(θ)=R_(φ)(θ) and second, M_(φ)(2kπ)=±R_(φ)(2kπε) when k is an integer. A composite pulse sequence can thus be obtained by finding ways to approximate R_(φ)(−θε) by a product of operators R_(φ) _(l) (2k_(l)πε). In the preferred embodiments, this is obtained using one of two approaches.

The first preferred embodiment is the Trotter-Suzuki (TS) method. Suzuki has developed a set of Trotter formulas that when given a Hermitian matrix B (B_(ij)*=B_(ji)) and a series of Hermitian matrices {A_(l)}, such that B=ΣA_(l), there exists a set of real numbers {p_(jn)} such that

$\begin{matrix} {{{\exp\left( {- {iBt}} \right)} = {{\prod\limits_{j,l}{\exp\left( {{- {ip}_{jn}}A_{l}t} \right)}} + {O\left( t^{n + 1} \right)}}},} & (2) \end{matrix}$

-   -   and Σ_(j)p_(jn)=1 [M. Suzuki, Phys. Lett. A 165, 387 (1992)].         Without loss of generality, this may be limited to expansions         where the p_(jn) are rational numbers and the assumption may be         made that the goal is to approximate R₀(−θε). Using Equation 2,         set t=ε and B=−(θ/2)X. Then choose A₁=A₃=mπ(X cos φ+Y sin φ) and         A₂=2mπ(X cos φ−Y sin φ), where φ and m fulfill the conditions         that 4mπ cos φ=θ/2 (i.e., A₁+A₂+A₃=B) and q_(jn)=p_(jn)m is an         integer. This yields an n th order correction sequence

$\begin{matrix} \begin{matrix} {F_{n} = {\prod\limits_{j}{{M_{\phi}\left( {2\pi\; q_{jn}} \right)}{M_{- \phi}\left( {4\pi\; q_{jn}} \right)}{M_{\phi}\left( {2\pi\; q_{jn}} \right)}}}} \\ {= {{R_{0}\left( {- {\theta ɛ}} \right)} + {O\left( ɛ^{n + 1} \right)}}} \\ {= {R_{0}^{\lbrack n\rbrack}\left( {- {\theta ɛ}} \right)}} \end{matrix} & (3) \end{matrix}$

-   -   and the associated n th order composite pulse sequence         F_(n)M₀(θ)=R₀ ^([n])(−θε)R₀(θε)R₀(θ)=R₀ ^([n])(θ), thus giving a         composite pulse sequence of arbitrary accuracy.

This embodiment is depicted schematically in FIG. 2. As depicted in FIG. 2, desired pulse 205, desired level of correction 210, and bandwidth 215 are provided as input variables for building 220 correction unitary 230 from imperfect rotations; beginning by recursively 235, 240 constructing in terms of composite pulses with a lower level of correction, and concluding with the base case 260, which is given by a formula 255 which depends on the desired bandwidth 250. This procedure outputs an n th order composite pulse 270.

The second preferred embodiment is called the Solovay-Kitaev (SK) method, as it uses elements of the proof of the Solovay-Kitaev theorem [A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi, Classical and Quantum Computation, vol. 47 of Graduate Studies in Mathematics (American Mathematical Society, Providence, 2002)]. First, note that rotations U_(k)(A)=I+Aε^(k)+O(ε^(k+1)) can be constructed for arbitrary 2×2 Hermitian matrices A, and k≧1, recursively. This is done using an observation (from [A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi, Classical and Quantum Computation, vol. 47 of Graduate Studies in Mathematics (American Mathematical Society, Providence, 2002)]) relating the commutator [A,B]=AB−BA to a sequence of operations, exp(−iAε^(l))exp(−iBε^(m))exp(iAε^(l))exp(iBε^(m))=exp([A,B]ε^(l+m))+O (ε^(l+m+1)). Thus to generate U_(k)(A), it suffices to generate U_(┌k/2┐)(B) and U_(└k/2┘)(C), such that [B,C]=A. Choices of integers other than ┌k/2┐ and └k/2┘ which sum to k are also fine, but less optimal.

Next, a composite pulse sequence F_(n) for R₀(θ) is inductively constructed. Note that the first order correction sequence can be written as F₁=M_(φ)(2π)M_(−φ)(2π)=R₀(−θε)+O(ε²) by selecting 4π cos(φ)=θ.

Assuming F_(n)=R₀(−θε)−iA_(n+1)ε^(n+1)+O(e^(n+2)), a sequence may be constructed to correct for the next order, using F_(n+1)=U_(n+1)(A_(n+1))F_(n), where U_(n+1)(A_(n+1)) is constructed as above. Iteratively applying this method for k=1, . . . , n yields an n th order composite pulse sequence, F_(n)M₀(θ)=R₀ ^([n])(θ), for any n. This embodiment, which appears to be unrelated to previous composite pulse techniques [R. Freeman, Spin Choreography (Spektrum, Oxford, 1997); M. Levitt and R. R. Ernst, J. Magn. Reson. 55, 247 (1983)], provides an efficient mechanism for calculating sequences for specific θ and φ but no short analytic description.

This embodiment is depicted schematically in FIG. 3. As depicted in FIG. 3, the difference between desired pulse 305 and n th order composite pulse 310 (beginning with n=1 and continuing until n reaches the desired level of correction) is calculated 315 and used to produce the next correction unitary 320. Approximate correction unitary 325 from imperfect rotations is either (for n>1) 330 decomposed into a commutator 340 of rotations which are recursively determined 335, or in the base case (n=1) 345 is determined by application of the TS method 350, 355. Approximate correction unitary 360 is then used to apply correction 365 in order to produce (n+1)th order composite pulse 370.

The TS and SK embodiments are general and apply to a wide variety of errors. Explicit application of the techniques to generate R₀ ^([n])(θ) sequences for specific n can take advantage of symmetry arguments, composition of techniques, and relax some of the assumptions in order to minimize both the residual error and the sequence length.

First, the TS composite pulses are explicitly written out and connected to the well-known pulse sequences of Wimperis [S. Wimperis, J. Magn. Reson. B 109, 221 (1994)]. Use of the TS formulas that are symmetric under reversal of pulses, i.e. an anagram, is chosen. These formulas remove all even-ordered errors by symmetry, and thus yield only even-order composite pulse sequences. For convenience, the notation S₁(φ₁,φ₂,m)=M_(φ) ₁ (mπ)M_(φ) ₂ (2mπ)M_(φ1)(mπ) and S_(n)(φ₁,φ₂,m)=S_(n−1)(φ₁,φ₂,m)⁴ ^(n−1) S_(n−1)(φ₁,φ₂,−2m)S_(n−1)(φ₁,φ₂,m)⁴ ^(n−1) is introduced. A series of n order composite pulses P n can now be defined as P0=M ₀(θ) P2=M _(φ) ₁ (2π)M _(−φ) ₁ (4π)M _(φ) ₁ (2π)P0 P2j=S _(j)(φ_(j),−φ_(j),2)P0

-   -   where

$\phi_{j} = {{\cos^{- 1} - {\frac{\theta}{8\pi\; f_{j}}\mspace{14mu}{and}\mspace{14mu} f_{j}}} = {\left( {2^{({{2j} - 1})} - 2} \right)f_{j - 1}}}$ when ƒ₁=1. P2 is exactly the passband sequence PB1 described by Wimperis [S. Wimperis, J. Magn. Reson. B 109, 221 (1994)].

FIG. 4 compares the performance of these high-order passband pulse sequences. The Wimperis BB1, PB1, and NB1 sequences are included in this family, and are equivalent to B2, P2, and N2. In FIG. 4, the planar magnetization following A π/2 pulse is shown as a function of NMR signal (au) and systematic error (ε). Solid line 410 is the uncorrected pulse, while the dotted lines above 420 pulse 410 are broadband pulses and those below 430 are narrowband pulses.

Wimperis also proposes a similar broadband sequence, BB1=S₁(φ_(B1),3φ_(B1),1)P0 where

$\phi_{B1} = {{\cos^{- 1}\left( {- \frac{\theta}{4\pi}} \right)}.}$ The broadband sequence corrects over a wider range of ε by minimizing the first order commutator and thus the leading order errors. Furthermore, although BB1 and PB1 appear different when written as imperfect rotations, a transformation to true rotations shows that they have the same form,

$\begin{matrix} {{PB1} = {{M_{\phi_{1}}\left( {2\pi} \right)}{M_{- \phi_{1}}\left( {4\pi} \right)}{M_{\phi_{1}}\left( {2\pi} \right)}{P0}}} \\ {= {{R_{\phi_{1}}\left( {2{\pi ɛ}} \right)}{R_{- \phi_{1}}\left( {4{\pi ɛ}} \right)}{R_{\phi_{1}}\left( {2{\pi ɛ}} \right)}{P0}}} \end{matrix}$ $\begin{matrix} {{BB1} = {{M_{\phi_{B1}}(\pi)}{M_{3\phi_{B1}}\left( {2\pi} \right)}{M_{\phi_{B1}}(\pi)}{P0}}} \\ {= {{R_{\phi_{B1}}({\pi ɛ})}{R_{- \phi_{B1}}\left( {2{\pi ɛ}} \right)}{R_{\phi_{B1}}({\pi ɛ})}{{P0}.}}} \end{matrix}$

This “toggled” frame suggests a way to create higher-order broadband pulses. One simply takes a higher-order passband sequence and replaces each element S₁(φ_(j),−φ_(j),m) with S₁(φ_(Bj),−φ_(Bj)+4φ_(Bj)(m/2 mod 2), m/2) where φ_(Bj) satisfies the condition cos(φ_(Bj))=2 cos(φ_(j)). Applying this to P n creates a family of broadband composite pulses, B n.

Similar extensions allow creation of another kind of composite pulse that increase error, so as to perform the desired operation for only a small window of error. Such “narrowband” pulse sequences N n may be obtained starting with a passband sequence, P n, and dividing the angles of the corrective pulses by 2. These higher-order narrowband pulses may be compared with the Wimperis sequence NB1 [S. Wimperis, J. Magn. Reson. B 109, 221 (1994)], as shown in FIG. 4. They may allow a new method of performing magnetic resonance imaging, in which RF inhomogeneity is used to select some region of space.

The SK embodiment yields a third set of n th order composite pulses, SK n, and for concreteness, an explicit formulation of this method is presented. It is convenient to let

${{U_{nX}(a)} = {I - {{ia}^{n}\frac{X}{2}ɛ^{n}} + {O\left( ɛ^{n + 1} \right)}}},$ such that one can then generate U_(nZ)(α)=M₉₀(−π/2)U_(nX)(α)M₉₀(π/2) and U_(nY)(α)=M₄₅(π/2)U_(nX)(α)M₄₅(−π/2). The optimal way to generate U_(nY) is to shift the phases, φ, of the underlying M_(φ)(θ) that generate U_(nx) by 90 degrees. Using the first-order rotations

$\begin{matrix} {{{U_{1X}(a)} = {{M_{\phi}\left( {2\pi\left\lceil \frac{a}{4\pi} \right\rceil} \right)}{M_{- \phi}\left( {2\pi\left\lceil \frac{a}{4\pi} \right\rceil} \right)}}},} & (6) \end{matrix}$

-   -   where

${\phi = {\cos^{- 1}\left( {a/\left( {4\pi\left\lceil \frac{a}{4\pi} \right\rceil} \right)} \right)}},$ as described above, we may recursively construct U_(nX)(α)=U_(└n/2┘Y)(α)U_(┌n/2┐Z)(α)U_(└n/2┘Y)(−α)U_(┌n/2┐Z)(−α), for any n>1. and any α.

With these definitions, the first order SK composite pulse for R₀ ^([n])(θ) is simply

$\begin{matrix} {{SK1} = {{{U_{1X}(\theta)}{M_{0}(\theta)}} = {{R_{0}(\theta)} - {i\;\frac{A_{2}}{2}ɛ^{2}} + {{O\left( ɛ^{3} \right)}.}}}} & (7) \end{matrix}$ From the 2×2 matrix A₂, the norm ∥A₂∥ and the planar rotation R_(A) ₂ that performs R_(A) ₂ (−A₂)R_(A) ₂ ⁻¹=∥A₂∥X can then be calculated. The second order SK composite pulse is then

$\begin{matrix} {{SK2} = {M_{A_{2}}^{- 1}{U_{2X}\left( {A_{2}}^{1/2} \right)}M_{A_{2}}{SK1}}} & (8) \\ {\mspace{45mu}{= {{R_{0}(\theta)} - {i\;\frac{A_{3}}{2}ɛ^{3}} + {O\left( ɛ^{4} \right)}}}} & (9) \end{matrix}$

-   -   where M_(A) ₂ is the imperfect rotation corresponding to the         perfect rotation R_(A) ₂ . The n th order SK composite pulse         family is thus

$\begin{matrix} {{SKn} = {M_{A_{n}}^{- 1}{U_{nX}\left( {A_{n}}^{1/n} \right)}M_{A_{n}}{{SK}\left( {n - 1} \right)}}} & (10) \\ {\mspace{50mu}{= {{R_{0}(\theta)} - {i\;\frac{A_{n + 1}}{2}ɛ^{n + 1}} + {{O\left( ɛ^{n + 2} \right)}.}}}} & (11) \end{matrix}$

A nice feature of the SK embodiment is that, when given a composite pulse of order n described by any method, a pulse of order n+1 may be composed. The “pure” SK method SK n is outperformed in terms of both error reduction and pulse number by the TS method B n for n≦4. Therefore, the SK method is typically applied for orders n>4, using B 4 as the base composite pulse. These pulses are labeled SB n.

Two important issues with composite pulses are the actual amount of error reduction as a function of pulse error, and the time required to achieve a desired amount of error reduction. These performance metrics are shown in FIG. 5, comparing the SK, broadband, and passband composite pulses for varying error ε, and φ=0, and using as the composite pulse error E=∥R_(φ)(θ)−R_(φ) ^([n])(θ)∥. For practical values of error reduction, n<30, the number of π pulses required to reduce error to O(ε^(n)) grows as □n^(3.09), which is close to the lower bound of □n³ which can be analytically derived.

In FIG. 5, the asymptotic performance of various composite pulses are shown as a function of composite pulse error (E) and base error (ε). P n, B n, SK n and SB n are the n th order passband, broadband, SK, and combined B4-SK sequences, respectively. The number in the brackets refers to the number of imperfect 2π rotations in the correction sequence. Note how pulses of the same order (such as P6, B6, SK6, SB6) have the same slope (asymptotic scaling) for low values of ε, but can have widely varying performance when ε is large. The inset plots the scaling of this sequence length with order n for SK n (SB n is very similar) for n≦30 and compares it with the upper bound of O(n³).

For a wide range of base errors ε, the TS embodiment out-performs the SK embodiment in achieving a low composite pulse error, E. The recursive nature of the TS method builds off elements that remove lower order errors, resulting in a rapid increase of pulse number and a monotonic decrease in effective error at every order for any value of the base error. However, the SK approach is superior to the TS method for applications requiring incredible precision, E≦10⁻¹², from relatively precise controls, ε<10^(−2.)

Furthermore, the SK method is more efficient at generating higher order pulses than the TS method. We compare this efficiency by counting the number of 2π imperfect rotations in the sequence. After cancellation of pulse pairs of the form U^(†)U, the TS method P n requires N(n/2) 2π pulses where N(n/2) is defined by the recursion relation N(k)=(2^(2k−1)+2)N(k−1)−4 and N(1)=4. The TS method B n requires N(n/2)/2 2π pulses. In both methods, the pulse length increases rapidly as O(exp(n²)).

A bound on the length of SK n can be obtained by noting that correcting an ε^(k) term requires four times as many pulses as correcting an ε^(k/)2 term; solving this recurrence yields a cos t of O(k²). To correct R_(φ)(θε) to O(ε^(n)) requires performing this correction for k=1, . . . , n for a total cost of O(n³) pulses. As mentioned above, this bound applies for practical values of n (n≦30), even though the magnitude of the pulses to correct A_(k)ε^(k) is proportional to ∥A_(k)∥^(1/k), which might be much larger than 2π.

The SK and TS pulse sequences presented here are conceptually simple but may not be optimal when used alone. In an alternate embodiment, new families of composite pulses are developed by integrating ideas from both methods. As an example, the SK method relies on cancellation of error order by order by building up sequences of 2π pulses. However, there is no reason that the basic unit should be a single pulse. Instead, a sequence may be built from TS (B2)-style pulse triplets, G(φ₁)=S₁(φ₁,3φ₁,1). By using an additional symmetry that Tr(YG(−φ₁)G(φ₁))=0, the leading order error is guaranteed to be proportional to X at the cost of doubling the pulse sequence. The resulting pulses are of length exp(n) (compared to exp(n²) for TS) and are broadband compared to SK sequences.

The present invention demonstrates that it is possible to generate composite pulse sequences that perform arbitrarily accurate rotations using pulses that have a systematic, but unknown, error in rotation angle. These can be constructed with O(n³) pulses, for n≦≈30. For high-precision applications, such as quantum computation, these pulses allow performance of accurate operations even with large errors. Practically, the B4 and B2=BB1 pulse sequences seem most useful, depending on the magnitude of error.

While specific composite pulse sequences for correcting rotation errors are disclosed herein, the present invention may also be applied to correct systematic errors in control phase and frequency. Also, both the TS and SK approaches can be extended to any set of operations that has a subgroup isomorphic to rotations of a spin. For example, Jones has used this isomorphism to create reliable two qubit gates based on an Ising interaction to accuracy O(ε³) [J. Jones, Phys. Rev. A 67, 012317 (2002)]. Similarly, the present invention can immediately be applied to provide arbitrary accuracy multi-qubit gates. Interestingly, the TS formula can be directly applied to any set of operations, if the operations suffer from proportional systematic timing errors. Therefore, this control method may also be applied to classical systems.

The apparatus and method of the present invention, therefore, provide composite pulses that are both fully compensating and able to correct errors arbitrarily well. Each of the various embodiments described above may be combined with other described embodiments in order to provide multiple features. Furthermore, while the foregoing describes a number of separate embodiments of the apparatus and method of the present invention, what has been described herein is merely illustrative of the application of the principles of the present invention. Other arrangements, methods, modifications and substitutions by one of ordinary skill in the art are therefore also considered to be within the scope of the present invention, which is not to be limited except by the claims that follow. 

1. A method for transforming, in a quantum computer or nuclear magnetic resonance device, a bare pulse into a fully-compensating composite pulse sequence of arbitrary accuracy, comprising the steps of: generating a composite pulse sequence such that, wherein the composite pulse sequence, denoted by R_(φ) ^([n])(θ), is a sequence of operations {M_(φ) ₁ (θ₁), . . . , M_(φ) ₁ (θ₁)} such that R_(φ) ^([n])(θ)=M_(φ) ₁ (θ₁)M_(φ) ₂ (φ₂) . . . M_(φ) ₁ (θ_(l))=R_(φ)(θ)+O(ε^(n+1)),for unknown error ε, R_(φ)(−θε) is approximated by a product of operators R_(φ) ₁ (2k_(l)πε); and replacing the bare pulse with the generated fully-compensating composite pulse sequence.
 2. The method of claim 1, further comprising the steps of: given a set of real numbers {p_(jn)}, where ${{\sum\limits_{j}\; p_{jn}} = 1},$ such that for any Hermitian matrix B (B_(ij)*=B_(ji)) and a series of Hermitian matrices {A_(l)}, such that ${B = {\sum A_{l}}},{{{then}\mspace{14mu}{\exp\left( {- {iBt}} \right)}} = {{\prod\limits_{j,l}{\exp\left( {{- {ip}_{jn}}A_{l}t} \right)}} + {O\left( t^{n + 1} \right)}}},$ setting t=ε and B=−(θ/2)X, choosing A₁=A₃=mπ(X cos φ+Y sin φ) and A₂=2Mπ(X cos φ−Y sin φ), wherein φ and m fulfill the conditions that 4mπ cos φ=θ/2 and q_(jn)=p_(jn)m is an integer; producing thereby an nth order correction sequence: $\begin{matrix} {F_{n} = {\prod\limits_{j}{{M_{\phi}\left( {2\pi\; q_{jn}} \right)}{M_{- \phi}\left( {4\pi\; q_{jn}} \right)}{M_{\phi}\left( {2\pi\; q_{jn}} \right)}}}} \\ {= {{R_{0}\left( {- {\theta ɛ}} \right)} + {O\left( ɛ^{n + 1} \right)}}} \\ {{= {R_{0}^{\lbrack n\rbrack}\left( {- {\theta ɛ}} \right)}};{and}} \end{matrix}$ producing thereby an associated nth order composite pulse sequence: F_(n)M₀(θ)=R₀ ^([n])(−θε)R₀(θε)R₀(θ)=R₀ ^([n])(θ).
 3. The method of claim 1, further comprising the steps of recursively constructing rotations U_(k)(A)=I+Aε^(k)+O(ε^(k+1)) for arbitrary 2×2 Hermitian matrices A, and k≧1, by relating a commutator [A,B]=AB−BA to a sequence of operations, exp(−Aε^(l)) exp(−iBε^(m)) exp(iAε^(l)) exp(iBε^(m))=exp([A,B]ε^(l+m))+O(ε^(l+m+1)) generating U_(┌k/2┐)(B) and U_(└k/2┘)(C), such that [B,C]=A; and iteratively constructing an nth order composite pulse sequence, F_(n)M₀(θ)=R₀ ^([n])(θ) for any n by the steps of: producing a first order correction sequence F₁=M_(φ)(2π)M_(−φ)(2π)=R₀(−θε)+(ε²) by selecting 4π cos(φ)=θ; and for each k=1. . . n, performing the steps of: assuming F_(k)=R₀(−θε)−iA_(k+1)ε^(k+1)+O(ε^(k+2)); and producing a next order correction sequence F_(k+1)=U_(k+1)(A_(k+1))F_(k).
 4. The method of claim 1, further including the step of: given an nth order composite pulse sequence generated by any method, constructing a composite pulse sequence of order n+1 by the steps of: recursively constructing rotations U_(k)(A)=I+Aθ^(k)+O(ε^(k+1)) for arbitrary 2×2 Hermitian matrices A, and k≧1, by relating a commutator [A,B]=AB−BA to a sequence of operations, exp(−Aε^(l))exp(−Bε^(m))exp(iAε^(l))exp(iBε^(m))=exp([A,B]ε^(l+m))+O(ε^(l+m+1)), thereby generating U_(┌k/2┐)(B) and U_(└k/2┘)(C), such that [B,C]=A; and inductively constructing composite pulse sequence F_(n+1) for R₀(θ) by the steps of: producing a correction sequence F_(n+1)=U_(n+1)(A_(n+1))F_(n); and producing a composite pulse sequence of order n+1, F_(n+1)M₀(θ)=R₀ ^([n+1])(θ).
 5. The method of claim 1, further comprising the step of controlling a qubit gate, a nuclear magnetic resonance device, or a quantum computer with the generated fully-compensating composite pulse sequence.
 6. The method of claim 1, wherein the generated fully-compensating composite pulse sequence has a greater error than the bare pulse.
 7. A method for correcting pulse control errors of one or more bare pulses in a pulse sequence generated by a quantum computer or nuclear magnetic resonance device, comprising the steps of: generating, in a quantum computer or nuclear magnetic resonance device, at least one fully-compensating composite pulse sequence of arbitrary accuracy having the properties: wherein the composite pulse sequence, denoted R_(φ) ^([n])(θ), is a sequence of operations {M_(φ) ₁ (θ₁), . . . , M_(φ) ₁ (θ)} such that R_(φ) ^([n])(θ)=M_(φ) ₁ (θ₁)M_(φ2)(θ₂) . . . M_(φ) ₁ (θ_(l))=R_(φ)(θ)+O(ε^(n+1)), for unknown error ε, R_(φ)(−θε) is approximated by a product of operators R_(φ) ₁ (2k₁πε); and replacing one or more bare pulses having errors with one or more generated fully-compensating composite pulse sequence to obtain a corrected pulse sequence having fewer errors.
 8. The method of claim 7, the composite pulse sequence further having the properties: given a set of real numbers {_(jn)}, where ${{\sum\limits_{j}\; p_{jn}} = 1},$ such that for any Hermitian matrix B (B_(ij)*═B_(ji)) and a series of Hermitian matrices {A_(l)}, such that B=ΣA_(l), ${{{then}\mspace{14mu}{\exp\left( {- {iBt}} \right)}} = {{\prod\limits_{j,l}{\exp\left( {{- {ip}_{jn}}A_{l}t} \right)}} + {O\left( t^{n + 1} \right)}}},$ t=ε and B=(θ/2)X, A₁=A₃=mπ(X cos φ+Y sin φ) and A₂=2mπ(X cos φ−Y sin φ), wherein φ and m fulfill the conditions that 4mπ cos φ=θ/2 and q_(jn)=p_(jn)m is an integer, the nth order correction sequence is $\begin{matrix} {F_{n} = {\prod\limits_{j}\;{{M_{\phi}\left( {2\pi\; q_{jn}} \right)}{M_{- \phi}\left( {4\pi\; q_{jn}} \right)}{M_{\phi}\left( {2\pi\; q_{jn}} \right)}}}} \\ {{= {{{R_{0}\left( {- {\theta ɛ}} \right)} + {O\left( ɛ^{n + 1} \right)}} = {R_{0}^{\lbrack n\rbrack}\left( {- {\theta ɛ}} \right)}}};{and}} \end{matrix}$ the associated nth order composite pulse sequence is F_(n)M₀(θ)=R₀ ^([n])(−θε)R₀(θε)R₀(θ)=R₀ ^([n])(θ).
 9. The method of claim 7, the composite pulse sequence further having the properties: wherein rotations U_(k)(A)=I+Aε^(k)+O(ε_(k+1)) for arbitrary 2×2 Hermitian matrices A and k≧1, are recursively constructed by relating a commutator [A,B]=AB−BA to a sequence of operations, exp(−iAε^(l))exp(−iBε^(m))exp(iAε_(l))exp(iBε^(m))=exp([A,B]ε^(l+m))+O(ε^(l+m+1)), thereby generating U_(┌k/2┐)(B) and U_(└k/2┘)(C), such that [B,C]=A, an nth order composite pulse sequence, F_(n)M₀(θ)=R₀ ^([n])(θ), for any n, having: a first order correction sequence F₁=M_(φ()2π)M_(−φ)(2π)=R₀(−θε)+O(ε²), wherein 4π cos(φ)=θ; and for each k=1 . . . n, wherein F_(k)=R₀(θε)−iA_(k+1)ε^(k+1)+O(ε^(k+2)), a next order correction sequence F_(k+1)=U_(k+1)(A_(k+1))F_(k).
 10. The method of claim 7, further comprising the step of controlling a qubit gate, a nuclear magnetic resonance device, or a quantum computer with the corrected pulse sequence.
 11. The method of claim 7, further comprising the step of controlling the amount of reduction of error in the corrected pulse sequence by controlling the length of the generated fully-compensating composite pulse sequence.
 12. A computer-readable storage medium, the medium being characterized in that: the computer-readable storage medium contains code which, when executed in a processor, transforms a bare pulse into a fully-compensating composite pulse sequence of arbitrary accuracy by the steps of: generating, in a quantum computer or nuclear magnetic resonance device, a fully-compensating composite pulse sequence of arbitrary accuracy, wherein the composite pulse sequence, denoted by R_(φ) ^([n])(θ), is a sequence of operations {M_(φ) ₁ (θ₁), . . . , M_(φ) ₁ (θ_(l))} such that R_(φ) ^([n])(θ)=M_(φ) ₁ (θ₁)M_(φ) ₁ (θ₂) . . . M_(φ) ₁ (θ_(l))=R_(φ)(θ)+O(ε^(n+1)), for unknown error ε, R_(φ)(−θε) is approximated by a product of operators R_(φ) ₁ (2kπε); and replacing the bare pulse with the generated fully-compensating composite pulse sequence.
 13. The computer-readable storage medium of claim 12, the medium further containing code which, when executed in a processor, performs the steps of: given a set of real numbers {p_(jn)}, where ${{\sum\limits_{j}\; p_{jn}} = 1},$ such that for any Hermitian matrix B(B_(ij)*=B_(ji)) and a series of Hermitian matrices {A_(l)}, such that B=ΣA_(l), then ${{\exp\left( {{- {\mathbb{i}}}\;{Bt}} \right)} = {{\prod\limits_{j,l}\;{\exp\left( {{- {\mathbb{i}}}\; p_{jn}A_{l}t} \right)}} + {O\left( t^{n + 1} \right)}}},$ setting t=ε and B=−(θ/2)X. choosing A₁=A₃=mπ(X cos φ+Y sin φ) and A₂=2mπ(X cos φ−Y sin φ), wherein φ and m fulfill the conditions that 4mπ cos φ=θ/2 and q_(jn)=p_(jn)m is an integer; producing thereby an nth order correction sequence: $\begin{matrix} {F_{n} = {\prod\limits_{j}{{M_{\phi}\left( {2\pi\; q_{jn}} \right)}{M_{- \phi}\left( {4\pi\; q_{jn}} \right)}{M_{\phi}\left( {2\pi\; q_{jn}} \right)}}}} \\ {= {{R_{0}\left( {- {\theta ɛ}} \right)} + {O\left( ɛ^{n + 1} \right)}}} \\ {{= {R_{0}^{\lbrack n\rbrack}\left( {- {\theta ɛ}} \right)}};{and}} \end{matrix}$ producing thereby an associated nth order composite pulse sequence: F_(n)M₀(θ)=R₀ ^([n])(−θε)R₀(θε)R₀(θ)=R₀ ^([n])(θ).
 14. The computer-readable storage medium of claim 12, the medium further containing code which, when executed in a processor, performs the steps of: recursively constructing rotations U_(k)(A)=I+Aε^(k)+O(ε^(k+1)) for arbitrary 2×2 Hermitian matrices A, and k≧1, by relating a commutator [A,B]=AB−BA to a sequence of operations, exp(−iAε^(l))exp(−iBε^(m))exp(iAε^(l))exp(iBε^(m))=exp([A,B]ε^(l+m))+O(ε^(l+m+1)), thereby generating U_(┌k/2┐)(B) and U_(└k/2┘)(C), such that [B,C]=A; and iteratively constructing an nth order composite pulse sequence, F_(n)M₀(θ)=R₀ ^([n])(θ) for any n by the steps of: producing a first order correction sequence F₁=M_(φ()2π)M_(−φ)(2π)=R₀(−θε)+O(ε²) by selecting 4π cos(φ)=θ; and for each k=1 . . . n, performing the steps of: assuming F_(k)=R₀(−θε)−iA_(k+1)ε^(k+1)+O(ε^(k+2)); and producing a next order correction sequence F_(k+1)=U_(k+1)(A_(k+1))F_(k).
 15. A computer-readable storage medium, the medium being characterized in that: the computer-readable storage medium contains code which, when executed in a processor, performs a method for correcting pulse control errors of one or more bare pulses in a pulse sequence, comprising the steps of: generating at least one fully-compensating composite pulse sequence of arbitrary accuracy having the properties: wherein the composite pulse sequence, denoted R_(φ) ^([n])(θ), is a sequence of operations {M_(φ) ₁ (θ₁), . . . , M_(φ) ₁ (θ_(l))} such that R_(φ) ^([n])(θ)=M_(φ) ₁ (θ₁)M_(φ) ₁ (θ₂) . . . M_(φ) ₁ (θ₁)=R_(φ)(θ)+O(ε^(n+1)), for unknown error ε, R_(φ)(−θε) is approximated by a product of operators R_(φ) ₁ (2K₁πε); and replacing one or more bare pulses having errors with one or more generated fully-compensating composite pulse sequence to obtain a corrected pulse sequence having fewer errors.
 16. The computer-readable storage medium of claim 15, the medium further containing code which, when executed in a processor, performs the steps of: generating a composite pulse sequence further having the properties: given a set of real numbers {p_(jn)}, where ${{\sum\limits_{j}\; p_{jn}} = 1},$ such that for any Hermitian matrix B(B_(ij)*=B_(ji)) and a series of Hermitian matrices {A_(l)}, such that B=ΣA_(l), then ${{\exp\left( {{- {\mathbb{i}}}\;{Bt}} \right)} = {{\prod\limits_{j,l}\;{\exp\left( {{- {\mathbb{i}}}\; p_{jn}A_{l}t} \right)}} + {O\left( t^{n + 1} \right)}}},$ t=ε and B=−(θ/2)X, A₁=A₃=mπ(X cos φ+Y sin φ) and A₂=2mπ(X cos φ−Y sin φ), wherein φ and m fulfill the conditions that 4mπ cos φ=θ/2 and q_(jn)=p_(jn)m is an integer, the nth order correction sequence is $\begin{matrix} {F_{n} = {\prod\limits_{j}\;{{M_{\phi}\left( {2\;\pi\; q_{jn}} \right)}{M_{- \phi}\left( {4\;\pi\; q_{jn}} \right)}{M_{\phi}\left( {2\;\pi\; q_{jn}} \right)}}}} \\ {= {{{R_{0}\left( {{- \theta}\; ɛ} \right)} + {O\left( ɛ^{n + 1} \right)}} = {{R_{0}^{\lbrack n\rbrack}\left( {{- \theta}\; ɛ} \right)}\mspace{14mu}{and}}}} \end{matrix}$ the associated nth order composite pulse sequence is F _(n) M ₀(θ)=R ₀ ^([n])(−θε)R ₀(θε)R ₀(θ)=R ₀ ^([n])(θ).
 17. The computer-readable storage medium of claim 15, the medium further containing code which, when executed in a processor, performs the steps of: generating a composite pulse sequence further having the properties: wherein rotations U_(k)(A)=I+Aε^(k)+O(ε^(k+1)) for arbitrary 2×2 Hermitian matrices A, and k≧1, are recursively constructed by relating a commutator [A,B]=AB−BA to a sequence of operations, exp(−iAε^(l))exp(−iBε^(m))exp(iAε_(l))exp(iBε^(m))=exp([A,B]ε^(l+m))+O(ε^(l+m+1)), thereby generating U_(┌k/2┐)(B) and U_(└k/2┘)(C), such that [B,C]=A, an nth order composite pulse sequence, F_(n)M₀(θ)R₀ ^([n])(θ), for any n, having: a first order correction sequence F₁=M_(φ)(2π)M_(−φ)(2π)=R₀(−θε)+O(ε²), wherein 4π cos(φ)=θ; and for each k=1 . . . n, wherein F_(k)=R₀(−θε)−iA_(k+1)ε^(k+1)+O(ε^(k+2)), a next order correction sequence F_(k+1)=U_(k+1)(A_(k+1))F_(k).
 18. An apparatus for transforming a bare pulse into a fully-compensating composite pulse sequence of arbitrary accuracy, comprising: composite pulse generator for generating a composite pulse sequence such that, wherein the composite pulse sequence, denoted by R_(φ) ^([n])(θ), is a sequence of operations {M_(φ) ₁ (θ₁), . . . , M_(φ) ₁ (θ_(l))} such that R_(φ) ^([n])(θ)=M_(φ) ₁ (θ₁)M_(φ2)(θ₂) . . . M_(φ) ₁ (θ₁)=R_(φ)(θ)+O(ε^(n+1)), for unknown error ε, R_(φ)(−θε) is approximated by a product of operators R_(φ) ₁ (2k_(l)πε); and compensator for replacing the bare pulse with the generated fully-compensating composite pulse sequence of arbitrary accuracy.
 19. The apparatus of claim 18, the composite pulse generator further performing the steps of: given a set of real numbers {p_(jn)}, where ${{\sum\limits_{j}\; p_{jn}} = 1},$ such that for any Hermitian matrix B (B_(ij) ^(*=B) _(ji)) and a series of Hermitian matrices {A_(l)}, such that B =ΣA_(l), then ${{\exp\left( {- {iBt}} \right)} = {{\prod\limits_{j,l}{\exp\left( {{- {ip}_{jn}}A_{l}t} \right)}} + {O\left( t^{n + 1} \right)}}},$ setting t=ε and B=−(θ/2)X, choosing A₁=A₃=mπ(X cos φ+Y sin φ) and A₂=2mπ(X cos φ−Y sin φ), wherein φ and m fulfill the conditions that 4mπ cos =θ/2 and q_(jn)=p_(jn)m is an integer; producing thereby an nth order correction sequence: $\begin{matrix} {F_{n} = {\prod\limits_{j}\;{{M_{\phi}\left( {2\;\pi\; q_{jn}} \right)}{M_{- \phi}\left( {4\;\pi\; q_{jn}} \right)}{M_{\phi}\left( {2\;\pi\; q_{jn}} \right)}}}} \\ {= {{{R_{0}\left( {{- \theta}\; ɛ} \right)} + {O\left( ɛ^{n + 1} \right)}} = {{R_{0}^{\lbrack n\rbrack}\left( {{- \theta}\; ɛ} \right)}\text{;}\mspace{14mu}{and}}}} \end{matrix}$ producing thereby an associated nth order composite pulse sequence: F _(n) M ₀(θ)=R ₀ ^([n])(−θε)R ₀(θε)R ₀(θ)=R ₀ ^([n])(θ).
 20. The apparatus of claim 18, the composite pulse generator further performing the steps of: recursively constructing rotations U_(k)(A)=I+Aε^(k)+O(ε^(k+1)) for arbitrary 2×2 Hermitian matrices A, and k≧1, by relating a commutator [A,B]=AB−BA to a sequence of operations, exp(−iAε^(l))exp(−iBε^(m))exp(iAε₁)exp(iBε^(m))=exp([A,B]ε^(l+m))+O(ε^(l+m+1)), thereby generating U_(┌k/2┐)(B) and U_(└k/2┘)(C), such that [B,C]=A; and iteratively constructing an nth order composite pulse sequence, F_(n)M₀(θ)=R₀ ^([n])(θ) for any n by the steps of: producing a first order correction sequence F₁=M_(φ)(2π)M_(−φ)(2π)=R₀(−θε)+O(ε²) by selecting 4π cos(φ)=θ; and for each k=1 . . . n, performing the steps of: assuming F_(k)=R₀(−θε)−iA_(k+1)ε^(k+1)+O(ε^(k+2)); and producing a next order correction sequence F_(k+1)=U_(k+1)(A_(k+1))F_(k).
 21. The apparatus of claim 18, the composite pulse generator further performing the steps of: given an nth order composite pulse sequence generated by any method, constructing a composite pulse sequence of order n+1 by the steps of: recursively constructing rotations U_(k)(A)=I+Aε^(k)+O(ε^(k+1)) for arbitrary 2×2 Hermitian matrices A, and k≧1, by relating a commutator [A,B]=AB−BA to a sequence of operations, exp(−iAε¹)exp(−iBε^(m))exp(iAε_(l))exp(iBε^(m))=exp([A,B]ε^(1+m))+O(ε^(l+m+1)), thereby generating U_(┌k/2┐)(B) and U_(└k/2┘)(C), such that [B,C]=A; and inductively constructing composite pulse sequence F_(n+1) for R₀(θ) by the steps of: producing a correction sequence F_(n+1)=U_(n+1)(A_(n+1))F_(n); and producing a composite pulse sequence of order n+1, F _(n+1) M ₀(θ)=R ₀ ^([n+1])(θ).
 22. An apparatus for correcting pulse control errors of one or more bare pulses in a pulse sequence, comprising: composite pulse generator for generating at least one fully-compensating composite pulse sequence of arbitrary accuracy having the properties: wherein the composite pulse sequence, denoted R_(φ) ^([n])(θ), is a sequence of operations {M_(φ) ₁ (θ₁), . . . , M_(φ) ₁ (θ₁)} such that R_(φ) ^([n])(θ)=M_(φ) ₁ (θ₁)M_(φ) ₁ (θ₂) . . . M_(φ) ₁ (θ₁)=R_(φ)(θ)+O(ε^(n+1)), for unknown error ε, R_(φ)(−θε) is approximated by a product of operators R_(φ) ₁ (2k_(l)πε); and compensator for replacing one or more bare pulses having errors with one or more generated fully-compensating composite pulse sequence to obtain a corrected pulse sequence having fewer errors.
 23. The apparatus of claim 22, the composite pulse sequence further having the properties: given a set of real numbers {p_(jn)}, where ${{\sum\limits_{j}\; p_{jn}} = 1},$ such that for any Hermitian matrix B (B_(ij)*=B_(ji)) and a series of Hermitian matrices {A_(l)}, such that B=ΣA_(l), then ${{\exp\left( {{- {\mathbb{i}}}\;{Bt}} \right)} = {{\prod\limits_{j,l}\;{\exp\left( {{- {\mathbb{i}}}\; p_{jn}A_{l}t} \right)}} + {O\left( t^{n + 1} \right)}}},$ t=ε and B=−(θ/2)X, A₁=A₃=mπ(X cos φ+Y sin φ) and A₂=2mπ(X cos φ−Y sin φ), wherein φ and m fulfill the conditions that 4mπ cos φ=θ/2 and q_(jn)=p_(jn)m is an integer, the nth order correction sequence is $\begin{matrix} {F_{n} = {\prod\limits_{j}\;{{M_{\phi}\left( {2\;\pi\; q_{jn}} \right)}{M_{- \phi}\left( {4\;\pi\; q_{jn}} \right)}{M_{\phi}\left( {2\;\pi\; q_{jn}} \right)}}}} \\ {= {{{R_{0}\left( {{- \theta}\; ɛ} \right)} + {O\left( ɛ^{n + 1} \right)}} = {{R_{0}^{\lbrack n\rbrack}\left( {{- \theta}\; ɛ} \right)}\mspace{20mu}{and}}}} \end{matrix}$ the associated nth order composite pulse sequence is F _(n) M ₀(θ)=R ₀ ^([n])(−θε)R ₀(θε)R ₀(θ)=R ₀ ^([n])(θ).
 24. The apparatus of claim 22, the generated composite pulse sequence further having the properties: wherein rotations U_(k)(A)=I+Aε^(k)+O(ε^(k+1)) for arbitrary 2×2 Hermitian matrices A, and k≧1, are recursively constructed by relating a commutator [A,B]=AB−BA to a sequence of operations, exp(−iAε¹)exp(−iBε^(m))exp(iAε¹)exp(iBε^(m))=exp([A,B]ε^(1+m))+O(ε^(l+m+1)), thereby generating U_(┌k/2┐)(B) and U_(└k/2┘)(C), such that [B,C]=A; an nth order composite pulse sequence, F_(n)M₀(θ)=R₀ ^([n])(θ), for any n, having: a first order correction sequence F₁=M_(φ)(2π)M_(−φ)(2π)=R₀(−θε)+O(ε²), wherein 4π cos(φ)=θ, and for each k=1 . . . n, wherein F_(k)=R₀(−θε)−iA_(k+1)ε^(k+1)+(ε^(k+2)), a next order correction sequence F_(k+1)=U_(k+1)(A_(k+1))F_(k). 